Discrete Interpolation of G01 Codes in 2D Machining under Bounded Accelerations

In this paper, a new algorithm is proposed to interpolate G01 codes in 2D milling. Without resorting to smooth curve approximation, the algorithm makes full use of the acceleration bounds to change directions with optimal velocities at the cutter location points designated by the G01 codes, and then makes global lookahead and optimization to generate time-optimal interpolation of the G01 codes. The algorithm is realized and tested on NC wood carving machine, showing that when compared with the classical equalvelocity corner-turning method, the current method can reduce the machining time by 14%-115%, while maintaining better details than the classical method. Mathematics Subject Classification (2000). Primary 93C55; Secondary 49K30.